Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation

نویسندگان

  • Gill Barequet
  • Barbara Wolfers
چکیده

We consider the problem of nding a corridor (a separating strip) between two polygons, whose intersection with a third (convex) polygon is of maximum area. The application in mind is the interpolation in simple branching cases, where the sought volume branches from one contour in one slice into two polygons in another parallel slice. We present a linear-time plane-sweep algorithm which computes such a corridor. When the third polygon is not convex the running time of the algorithm is quadratic in the size of the input.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing a Strip Separating Two Polygons

We consider the problem of nding a strip separating between two polygons, whose intersection with a third (convex) polygon is of maximum area. We present an optimal linear-time algorithm for computing the optimum strip. When the third polygon is not convex, the running time of the algorithm is quadratic in the size of the input. The application in mind is the piecewise-linear surface interpolat...

متن کامل

Interpolating Polyhedral Models Using Intrinsic Shape Parameters

Metamorphosis, or morphing, is the gradual transformation of one shape into another. It generally consists of two subproblems: the correspondence problem and the interpolation problem. This paper presents a solution to the interpolation problem of transforming one polyhedral model into another. It is an extension of the intrinsic shape interpolation scheme (T. W. Sederberg, P. Gao, G. Wang and ...

متن کامل

Mapping is a Diffusion Problem

A variety of operations have been described in recent years that are intended as digital solutions to a basic class of cartographic adjacency problems. A selection of these algorithms includes: interpolation; Voronoi diagrams of point distributions (proximal maps, Thiessen polygons); skeleton encoding (of scanned characters or polygons); corridor selection, or extraction of regions within speci...

متن کامل

Matching of Polygon Objects by Optimizing Geometric Criteria

Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....

متن کامل

Synthesis, Characterization and Application of Zinc Oxide with Micro Polyhedral and Nano Plate Morphologies for Simultaneous Decolorization of Two- dye Mixture in Wastewater

In this work, growth and assembly of the micro polyhedral zinc oxide was performed using airbubble assisted Triton X100, as a templating agent. In absence of air bubbling in the reactionsystem the nano plate zinc oxide was synthesized. The prepared samples were characterized by Xraydiffraction (XRD), field emission scanning electron microscopy (FE-SEM) and UV-Visspectrop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996